Universally soluble

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universally Composable Undeniable Signature

How to define the security of undeniable signature schemes is a challenging task. This paper presents two security definitions of undeniable signature schemes which are more useful or natural than the existing definition. It then proves their equivalence. We first define the UC-security, where UC means universal composability. We next show that there exists a UC-secure undeniable signature sche...

متن کامل

Universally Composable Blind Signatures

This paper shows that the security of blind signatures is, as defined by Juels, Luby and Ostrovsky, truly weaker than the security in the universal composability (UC) framework (i.e., define the ideal functionality of blind signatures), which was introduced by Canetti. That is, we formulate the security of blind signatures in the UC framework, and show that the class of UC-secure blind signatur...

متن کامل

Universally Quantified Interval Constraints

Non-linear real constraint systems with universally and/or existentially quantified variables often need be solved in such contexts as control design or sensor planning. To date, these systems are mostly handled by computing a quantifier-free equivalent form by means of Cylindrical Algebraic Decomposition (CAD). However, CAD restricts its input to be conjunctions and disjunctions of polynomial ...

متن کامل

Universally Composable Key-Management

We present the first universally composable key-management functionality, formalized in the GNUC framework by Hofheinz and Shoup. It allows the enforcement of a wide range of security policies and can be extended by diverse key usage operations with no need to repeat the security proof. We illustrate its use by proving an implementation of a security token secure with respect to arbitrary key-u...

متن کامل

Universally noncommutative loops

We call a loop universally noncommutative if it does not have a loop isotope in which two non-identity elements commute. Finite universally noncommutative loops are equivalent to latin squares that avoid the configuration:

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Nanotechnology

سال: 2008

ISSN: 1748-3387,1748-3395

DOI: 10.1038/nnano.2008.376